Lower Bounds on the Multiparty Communication Complexity
نویسندگان
چکیده
منابع مشابه
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness
We show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Ω(n/4). This gives the first lower bound that is linear in n, nearly matching Grolmusz’s upper bound of O(log(n) + kn/2). We also simplify Sherstov’s proof showing an Ω( √ n/(k2)) lower bound for the randomized communication complexity of set disjointness.
متن کاملLower bounds on communication for multiparty computation
The present report contains a proof of a linear lower bound for a typical three-party secure computation scheme of n independent AND functions. The goal is to prove some linear communication lower bound for a maximally broad definition of «typical». The article [1] contains various communications lower bounds for unconditionally secure multiparty computation. In particular, it contains a linear...
متن کاملQuantum Multiparty Communication Complexity and Circuit Lower Bounds
We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result, we show that if the quantum k-party communication complexity of a function f is Ω( n 2k ), then its classical k-party communication is Ω( n 2k/2 ). Finding such an f would allow us to prove strong classical lower bounds for k ≥ log n players and...
متن کاملLower Bounds on Communication Complexity ∗
A notion of ”communication complexity” is used to formally measure the degree to which a Boolean function is ”global”. An explicit combinatorial lower bound for this complexity measure is presented. In particular, this leads to an exp(Ω( √ n)) lower bound on the complexity of depth-restricted contact schemes computing some natural Boolean functions in NP.
متن کاملUpper Bounds on the Communication Complexity of Cryptographic Multiparty Computation
We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n-party randomized function and show that if f can be computed by a circuit of size c, then O(cnκ+nκ) is an upper bound for active security with optimal resilience t < n/2 and security parameter κ. This improves on the communica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1998
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1547